package data_structures_algorithms.chapter03_linkdedlist;

public class DLLNode {
    private int data;
    private DLLNode next;
    private DLLNode previous;

    public DLLNode(int data) {
        this.data = data;
    }

    public int getData() {
        return data;
    }

    public void setData(int data) {
        this.data = data;
    }

    public DLLNode getNext() {
        return next;
    }

    public void setNext(DLLNode next) {
        this.next = next;
    }

    public DLLNode getPrevious() {
        return previous;
    }

    public void setPrevious(DLLNode previous) {
        this.previous = previous;
    }


    public DLLNode dllInsert(DLLNode headNode, DLLNode nodeToInsert, int position) {
        if (headNode == null) {
            return nodeToInsert;
        }

        int size = geDLLLength(headNode);

        return null;

    }

    private int geDLLLength(DLLNode headNode) {


        return 10;
    }

}
